package dynamic.subsequence;

/**
 * @Classname : LongestCommonSubsequence
 * @Description : 1143. 最长公共子序列
 * https://leetcode.cn/problems/longest-common-subsequence/
 * @Author : chentianyu
 * @Date 2022/9/27 22:23
 */


public class LongestCommonSubsequence {
    public int longestCommonSubsequence(String text1, String text2) {
        int m = text1.length(), n = text2.length();
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (text1.charAt(i - 1) == text2.charAt(j - 1)) {
                    dp[i][j] = 1 + dp[i - 1][j - 1];
                } else {
                    dp[i][j] = Math.max(dp[i][j - 1], dp[i - 1][j]);
                }
            }
        }
        return dp[m][n];
    }
}
